Grr Obner Bases and Normal Forms in a Subring of the Power Series Ring on Countably Many Variables

نویسنده

  • Jan Snellman
چکیده

If K is a eld, let the ring R 0 consist of nite sums of homogeneous elements in R = Kx 1 ; x 2 ; x 3 ; : : : ]]. Then, R 0 contains M, the free semi-group on the countable set of variables fx 1 ; x 2 ; x 3 ; : : :g. In this paper, we generalize the notion of admissible order from nitely generated sub-monoids of M to M itself; assume that > is such an admissible order on M. We show that we can deene leading power products, with respect to >, of elements in R 0 , and thus the initial ideal gr(I) of an arbitrary ideal I R 0. If I is what we call a locally nitely generated ideal, then we show that gr(I) is also locally nitely generated; this implies that I has a nite truncated Grr obner basis up to any total degree. We give an example of a nitely generated homogeneous ideal which has a non-nitely generated initial ideal with respect to the lexicographic initial order > lex on M.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1 HOW TO USE GR OBNER - MATHEMATICA 2 Global Variable Semantics Possible Values

In this paper we report on GR OBNER-Mathematica, an experimental implementation for computing Grr obner bases in Mathematica. This implementation in its current form ooers three diierent versions of the Grr obner bases algorithm and is generic with respect to the ordering of power products, the domain of coeecients of the polynomials, and the representation of power products, monomials, polynom...

متن کامل

Gröbner Bases and Normal Forms in a Subring of the Power Series Ring on Countably Many Variables

If K is a field, let the ring R′ consist of finite sums of homogeneous elements in R = K[[x1, x2, x3, . . .]]. Then, R′ contains M, the free semi-group on the countable set of variables {x1, x2, x3, . . .}. In this paper, we generalize the notion of admissible order from finitely generated sub-monoids of M to M itself; assume that > is such an admissible order on M. We show that we can define l...

متن کامل

Grr Obner Bases for Polynomial Ideals over Commutative Noetherian Rings and Related Results ?

We present a completion-like procedure for constructing weak and strong Grr obner bases for polynomial ideals over commutative Noetherian rings with unit. This generalizes all the known algorithms for computing Grr obner bases for polynomial ideals over various diierent coeecient domains. The coeecient domain is incorporated using constraints. Constraints allow us to describe an optimized proce...

متن کامل

On Grr Obner Bases in Monoid and Group Rings

Following Buchberger's approach to computing a Grr obner basis of a polynomial ideal in polynomial rings, a completion procedure for nitely generated right ideals in ZH] is given, where H is an ordered monoid presented by a nite, convergent semi{Thue system ((; T). Taking a nite set F ZH] we get a (possibly innnite) basis of the right ideal generated by F , such that using this basis we have un...

متن کامل

Xideal Grr Obner Bases for Exterior Algebra

1 Description The method of Grr obner bases in commutative polynomial rings introduced by Buchberger (e.g. 1]) is a well-known and very important tool in polynomial ideal theory, for example in solving the ideal membership problem. XIDEAL extends the method to exterior algebras using algorithms from 2]. There are two main departures from the commutative polynomial case. First, owing to the non-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997